Private Computation of Phylogenetic Trees Based on Quantum Technologies

Individuals’ privacy and legal regulations demand genomic data be handled studied with highly secure privacy-preserving techniques. In this work, we propose a feasible Secure Multiparty Computation (SMC) system assisted quantum cryptographic protocols that is designed to compute phylogenetic tree from set of private genome sequences. This significantly improves the security computation thanks three provide enhanced against computer attacks. adapts several distance-based methods (Unweighted Pair Group Method Arithmetic mean, Neighbour-Joining, Fitch-Margoliash) into setting where sequences owned by each party are not disclosed other members present in protocol. We theoretically evaluate performance guarantees through complexity analysis proof give an extensive explanation about implementation details protocols. also implement quantum-assisted based on Libscapi Yao, PHYLIP library simulated keys two systems: Quantum Oblivious Key Distribution Distribution. demonstrates its effectiveness practicality. benchmark classical-only solution conclude both approaches render similar execution times, only difference being time overhead taken oblivious key management approach.